Don't understand a measure? Learn it: Structured Prediction for Coreference Resolution optimizing its measures
نویسندگان
چکیده
An assential aspect of structured prediction is the evaluation of an output structure against the gold standard. Especially in the loss-augmented setting, the need of finding the max-violating constraint has severely limited the expressivity of effective loss functions. In this paper, we trade off exact computation for enabling the use of more complex loss functions for coreference resolution (CR). Most noteworthily, we show that such functions can be (i) automatically learned also from controversial but commonly accepted CR measures, e.g., MELA, and (ii) successfully used in learning algorithms. The accurate model comparison on the standard CoNLL–2012 setting shows the benefit of more expressive loss for Arabic and English data.
منابع مشابه
Corpus based coreference resolution for Farsi text
"Coreference resolution" or "finding all expressions that refer to the same entity" in a text, is one of the important requirements in natural language processing. Two words are coreference when both refer to a single entity in the text or the real world. So the main task of coreference resolution systems is to identify terms that refer to a unique entity. A coreference resolution tool could be...
متن کاملJoint Anaphoricity Detection and Coreference Resolution with Constrained Latent Structures
This paper introduces a new structured model for learning anaphoricity detection and coreference resolution in a joint fashion. Specifically, we use a latent tree to represent the full coreference and anaphoric structure of a document at a global level, and we jointly learn the parameters of the two models using a version of the structured perceptron algorithm. Our joint structured model is fur...
متن کاملA Constrained Latent Variable Model for Coreference Resolution
Coreference resolution is a well known clustering task in Natural Language Processing. In this paper, we describe the Latent Left Linking model (LM), a novel, principled, and linguistically motivated latent structured prediction approach to coreference resolution. We show that LM admits efficient inference and can be augmented with knowledge-based constraints; we also present a fast stochastic ...
متن کاملStructured Local Training and Biased Potential Functions for Conditional Random Fields with Application to Coreference Resolution
Conditional Random Fields (CRFs) have shown great success for problems involving structured output variables. However, for many real-world NLP applications, exact maximum-likelihood training is intractable because computing the global normalization factor even approximately can be extremely hard. In addition, optimizing likelihood often does not correlate with maximizing task-specific evaluatio...
متن کاملA Discriminative Latent Variable Model for Clustering of Streaming Data with Application to Coreference Resolution
We present a latent variable structured prediction model, called the Latent Left-linking Model (L3M), for discriminative supervised clustering of items that follow a streaming order. LM admits efficient inference and we present a learning framework for LM that smoothly interpolates between latent structural SVMs and hidden variable CRFs. We present a fast stochastic gradientbased learning techn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017